Using Term Space Maps to Capture Search Control Knowledge in Equational Theorem Proving
نویسندگان
چکیده
We describe a learning inference control heuristic for an equational theorem prover. The heuristic selects a number of problems similar to a new problem from a knowledge base and compiles information about good search decisions for these selected problems into a term space map, which is used to evaluate the search alternatives at an important choice point in the theorem prover. Experiments on the TPTP problem library show the improvements possible with this new approach.
منابع مشابه
Some Experiments on the Applicability of Folding Architecture
One of the major problems in theorem proving is control of the proof search. A promising approach is the application of machine learning techniques for the acquisition of search control knowledge by learning from successful proof searches. In this paper we brieey discuss this idea and existing machine learning techniques for this task. We suggest neural folding architecture networks together wi...
متن کاملSome Experiments on the Applicability of FoldingArchitecture Networks to Guide Theorem
One of the major problems in theorem proving is the control of proof search. A promising approach is the application of machine learning techniques for the acquisition of search control knowledge by learning from successful proof searches. In this paper we shortly discuss this idea and existing machine learning techniques for this task. We then suggest folding architecture networks trained with...
متن کاملFinite Model Search for Equational Theories (FMSET)
Finite model and counter model generation is a potential alternative in automated theorem proving. In this paper, we introduce a system called FMSET which generates finite structures representing models of equational theories. FMSET performs a satisfiability test over a set of special first order clauses called ”simple clauses”. Several experiments over a variety of problems have been pursued. ...
متن کاملAutomatic Acquisition of Search
We present two inference control heuristics for equational deduction that are based on the evaluation of previous successful proof attempts in domains of interest. The rst evaluation function works by symbolic retrieval of generalized patterns from a knowledge base, the second function compiles the knowledge into abstract term evaluation trees. Both heuristics have been implemented into the dis...
متن کاملTerm Space Mapping for DISCOUNT
We present a learning inference control heuristic implemented for the equational theorem prover DISCOUNT. Information about necessary and superruous facts generated during successful proof searches (positive and negative examples) is compiled into a term space map, a recursive structure describing aspects of the topology of term sets. This map is then used to compute evaluations for facts in ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999